- entire subtree
- 【NT】完整的子目录树
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
entire subtree
Look at other dictionaries:
Scapegoat tree — In computer science, a scapegoat tree is a self balancing binary search tree, invented by Igal Galperin and Ronald L. Rivest. It provides worst case O(log n ) lookup time, and O(log n ) amortized insertion and deletion time.Unlike other self… … Wikipedia
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Lightweight Directory Access Protocol — The Lightweight Directory Access Protocol (LDAP; /ˈɛld … Wikipedia
Transposition table — In computer chess and other computer games, transposition tables are used to speed up the search of the game tree. Transposition tables are primarily useful in perfect information games, meaning the entire state of the game is known to all… … Wikipedia
Maximal munch — In computer programming and computer science, maximal munch or longest match is the principle that when creating some construct, as much of the available input as possible should be consumed. It is similar, though not entirely identical, to the… … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
König's lemma — or König s infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated… … Wikipedia
Enfilade (Xanadu) — Enfilades are a class of tree data structures used in Project Xanadu designs of the 1970s and 1980s. Enfilades allow quick editing, versioning, retrieval and inter comparison operations in a large, cross linked hypertext database. The Xanadu Gold … Wikipedia
B-tree — In computer science, a B tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. It is most commonly used in databases and filesystems. In B trees, internal (non leaf)… … Wikipedia
Newick format — In mathematics, Newick tree format (or Newick notation or New Hampshire tree format) is a way to represent graph theoretical trees with edge lengths using parentheses and commas. It was adopted by James Archie, William H. E. Day, Joseph… … Wikipedia
Árbol biselado — Un Árbol biselado o Árbol Splay es un Árbol binario de búsqueda auto balanceable, con la propiedad adicional de que a los elementos accedidos recientemente se accederá más rápidamente en accesos posteriores. Realiza operaciones básicas como… … Wikipedia Español
